MULTIWAVELET PACKETS AND FRAME PACKETS OF L 2 (R d)
نویسنده
چکیده
The orthonormal basis generated by a wavelet of L 2 (R) has poor frequency localization. To overcome this disadvantage Coifman, Meyer, and Wickerhauser constructed wavelet packets. We extend this concept to the higher dimensions where we consider arbitrary dilation matrices. The resulting basis of L 2 (R d) is called the multiwavelet packet basis. The concept of wavelet frame packet is also generalized to this setting. Further, we show how to construct various orthonormal bases of L 2 (R d) from the multiwavelet packets.
منابع مشابه
Multiwavelet Packets and Frame Packets of L
The orthonormal basis generated by a wavelet of L(R) has poor frequency localization. To overcome this disadvantage Coifman, Meyer, and Wickerhauser constructed wavelet packets. We extend this concept to the higher dimensions where we consider arbitrary dilation matrices. The resulting basis of L(R) is called the multiwavelet packet basis. The concept of wavelet frame packet is also generalized...
متن کاملWavelet Basis Packets and Wavelet Frame Packets
This article obtains the nonseparable version of wavelet packets on ~a and generalizes the "'unstability" result of nonorthogonal wavelet packets in Cohen-Daubechies to higher dimensional cases. 1 . I n t r o d u c t i o n The wavelet packets introduced by R. Coifman, Y. Meyer, and M. V. Wickerhauser played an important role in the applications of wavelet analysis as shown, for example, in [CMW...
متن کاملDigital Implementation of Ridgelet Packets
The Ridgelet Packets library provides a large family of orthonormal bases for functions f(x, y) in L(dxdy) which includes orthonormal ridgelets as well as bases deriving from tilings reminiscent from the theory of wavelets and the study of oscillatory Fourier integrals. An intuitively appealing feature: many of these bases have elements whose envelope is strongly aligned along specified ‘ridges...
متن کاملRouting and Job-shop Scheduling in O(congestion
2)L 0 such packets. Thus, w.h.p. the number of packets that are actually scheduled to cross e during the frame is at most (1? 0)f(n), where 0 is a function of. The number of steps a packet takes during the frame is at most f(n)=g(n). Therefore, using the assumed algorithm, we can schedule all the path segments that fall into this frame so that each packet is delivered within (1 +)(1 ? 0)f(n) + ...
متن کاملPackets in Packets: Orson Welles' In-Band Signaling Attacks for Modern Radios
Here we present methods for injecting raw frames at Layer 1 from within upper-layer protocols by abuse of in-band signaling mechanisms common to most digital radio protocols. This packet piggy-backing technique allows attackers to hide malicious packets inside packets that are permitted on the network. When these carefully crafted Packets-in-Packets (PIPs) traverse a wireless network, a bit err...
متن کامل